Although narcissists often emerge as leaders, the relationship between leader narcissism and follower performance is ambiguous and often even found to be negative. For women, narcissism seems especially likely to lead to negative evaluations. Since narcissists have the tendency to be impulsive and change their minds on a whim, they may come across as inconsistent. We propose “inconsistent leader behavior” as a new mechanism in the relationship between leader narcissism and follower performance and argue that leader gender plays an important (...) role in whether narcissistic leaders are perceived as inconsistent. Specifically, we expect leader narcissism to have a negative relationship with follower performance through perceived inconsistent leader behavior, especially for female leaders. Thus, we examine leader gender as a personal factor moderating the relationship between narcissism and perceived inconsistent behavior. Also, as perceived inconsistency is likely less problematic when a good relationship exists, we examine leader–member exchange as a contextual condition moderating the relationship between leader behavior and follower performance. We test our moderated mediation model in a multi-source study with 165 unique leader–follower dyads. As expected, leader narcissism was positively related to perceived inconsistent leader behavior, and this relationship was stronger for female leaders. Inconsistent leader behavior was negatively related to follower performance, but only when LMX was low. Our research highlights that perceived behavioral inconsistency can be problematic and—for female leaders—provides an explanation of the negative relation of leader narcissism with follower performance and of the inconsistencies in evaluations of narcissistic leaders’ effectiveness. (shrink)

The paper presents a speculative model for associative memory. It has two layers: the lower layer describes memory of a single cell, the upper layer describes how the work is distributed address-free over a large set of cells. Thinking, consciousness and various features of memory are interpreted in terms of the memory model.

The tree-based data structure of -tree for propositional formulas is introduced in an improved and optimised form. The -trees allow a compact representation for negation normal forms as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. These reduction strategies are divided into two subsets (meaning- and satisfiability-preserving transformations) and can be used to decrease the size of a negation normal form A (...) at (at most) quadratic cost. The reduction strategies are aimed at decreasing the number of required branchings and, therefore, these strategies allow to limit the size of the search space for the SAT problem. (shrink)

Dealing with soldier enhancement can be challenging for military physicians. As research on the ethics of soldier enhancement is mostly theoretical, this study aims to gain insights into the actual moral issues military physicians encounter, or expect to encounter. To that end, we carried out a qualitative study involving six focus groups of Dutch military physicians (n = 28) in operational roles. The participants voiced their concerns about moral issues concerning soldier enhancement. Based on the group discussions, and using inductive (...) thematic analysis, we ascertained three major themes: (1) Doing no harm in soldier enhancement: uncertainty and high stakes; (2) Dependency relationships and conflicting moral responsibilities; and (3) The risk of ethical slippery slopes. Our findings illustrate that dealing with these moral responsibilities requires considerable skill and acuity to weigh up for all the situated complexities and dependency relationships that go beyond abstract rules or moral principles. A care-ethical approach that acknowledges the contextual and relational aspects of moral complexities along with peer consultation and joint reflective dialogue on moral issues can help military physicians deal with soldier enhancement responsibly. (shrink)

The intention here is that of giving a formal underpinning to the idea of 'meaning-is-use' which, even if based on proofs, it is rather different from proof-theoretic semantics as in the Dummett-Prawitz tradition. Instead, it is based on the idea that the meaning of logical constants are given by the explanation of immediate consequences, which in formalistic terms means the effect of elimination rules on the result of introduction rules, i. e. the so-called reduction rules. For that we suggest an (...) extension to the Curry-Howard interpretation which draws on the idea of labelled deduction, and brings back Frege's device of variable-abstraction to operate on the labels (i. e., proof-terms) alongside formulas of predicate logic. (shrink)

SummaryLooking at proof theory as an attempt to ‘code’ the general pattern of the logical steps of a mathematical proof, the question of what kind of rules can make the meaning of a logical connective completely explicit does not seem to have been answered satisfactorily. The lambda calculus seems to have been more coherent simply because the use of ‘λ’ together with its projection 'apply' is specified by what can be called a 'reduction' rule: β‐conversion. We attempt to analyse the (...) role of proof rules, making use of a set of formal rules designed to capture both the notions of proof theory and those of the lambda‐calculus: Martin‐Löf's Intuitionistic Type Theory.RésuméSi on considère la théorie de la démonstration comme une tentative de ‘codifier’ les pas logiques d'une démonstration mathématique, on se rendra compte qu'on n'a pas répondu de façon satisfaisante à la question suivante: quelles sont les règies qui rendent complètement explicite le sens d'un connecteur logique? Le lambda‐calcul a été apparemment plus cohérent, tout simplement parce que l'utilisation du‘λ’ avec sa projection 'apply' est spécifiée par une regie de 'réduction': β‐conversion. Nous essayons d'analyser le rôle des règies de démonstration, en utilisant un système formel de règies conçu pour englober à la fois les notions de la théorie de la démonstration et celles du lambda‐calcul: la Théorie Intuitionniste des Types de Martin‐Löf.ZusammenfassungWenn man Beweistheorie als einen Versuch, ein allgemeines Muster der logischen Schritte in einem mathematischen Beweis zu kodifizieren, betrachtet, so scheint die Frage nach der Art von Regeln , die die Bedeutung von logischen Operatoren vollständig beschreiben, nicht zufriedenstellend beantwortet. Der Lambda‐Kalkül erscheint, kohärenter, einfach deshalb weil der Gebrauch von ‘λ’ zusammen mit dessen Projektion 'apply' durch Regeln bestimmt wird, die man 'Reduktions'‐Regeln nennen kann: β‐Konversion. Wir versuchen, die Rolle von Beweisregeln zu analysieren, indem wir ein Regelsystem verwenden, das sowohl die Begriffe der Beweistheorie als auch diejenigen des Lambda‐Kalküls erfasst, nämlich die Martin‐Löfsche Typentheorie. (shrink)

Semantic Automata Johan van Ben them. INTRODUCTION An attractive, but never very central idea in modern semantics has been to regard linguistic expressions ...

The intention here is that of giving a formal underpinning to the idea of ‘meaning-is-use’ which, even if based on proofs, it is rather different from proof-theoretic semantics as in the Dummett–Prawitz tradition. Instead, it is based on the idea that the meaning of logical constants are given by the explanation of immediate consequences, which in formalistic terms means the effect of elimination rules on the result of introduction rules, i.e. the so-called reduction rules. For that we suggest an extension (...) to the Curry– Howard interpretation which draws on the idea of labelled deduction, and brings back Frege’s device of variable-abstraction to operate on the labels (i.e., proof-terms) alongside formulas of predicate logic. (shrink)